A classical introduction to cryptography - applications for communications security

نویسنده

  • Serge Vaudenay
چکیده

The book is aimed at bridging the gap between cryptography and its standard applications. From my point of view, it has achieved its goal. This book presents basic tools of cryptography with applications in communication and information security. This book is a compilation of author’s lecture notes that he used for teaching cryptography to undergraduate students. Though this book is titled like any other introductory books on cryptography, this is actually an advanced level textbook covering prehistory of cryptography; symmetric key cryptography; public key cryptography; mathematical topics like algorithmic algebra and number theory for cryptologists and other cryptographic protocols. This book differs significantly from other introductory books, since it covers some topics that other books did not. For example, RSA exponent problem and its equivalence to factorization problem is covered in this book. Also some topics from cryptanalysis of both symmetric and asymmetric primitives are well presented, though it is a book on cryptography. The most important point is that every concept is discussed intuitively with rigorous mathematics. A reader can find how beautiful is cryptography when it joins hand with mathematics. But at the same time too much mathematics will be too boring for some readers and they may find this book difficult to read. This book will answer two questions once it is read. First question is how important is cryptography in todays world and the second question is how fun is cryptography with mathematics. All complexity theory and mathematical preliminaries needed are covered in separate chapters of the book. This means a reader with no mathematical background could directly start reading this book. But a better insight into several discussion points requires additional reading.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Provably secure and efficient identity-based key agreement protocol for independent PKGs using ECC

Key agreement protocols are essential for secure communications in open and distributed environments. Recently, identity-based key agreement protocols have been increasingly researched because of the simplicity of public key management. The basic idea behind an identity-based cryptosystem is that a public key is the identity (an arbitrary string) of a user, and the corresponding private key is ...

متن کامل

A new security proof for FMNV continuous non-malleable encoding scheme

A non-malleable code is a variant of an encoding scheme which is resilient to tampering attacks. The main idea behind non-malleable coding is that the adversary should not be able to obtain any valuable information about the message. Non-malleable codes are used in tamper-resilient cryptography and protecting memories against tampering attacks. Many different types of non-malleability have alre...

متن کامل

Network Architectures for Space-Optical Quantum Cryptography Services Introduction of Quantum Communications in Satellite Communication Networks

Quantum cryptography enables the distribution of ‘information-theoretically’ secure (ITS) keys, whose secrecy is guaranteed by the laws of quantum physics. Such a level of security is superior to conventional ‘classical’ cryptography whose security is at most ‘computational’, and even this lower security level is unverified in many cases. Fiber-based quantum key distribution (QKD) systems for l...

متن کامل

Enhancement of Network Security Techniques using Quantum Cryptography

Quantum cryptography uses the law of quantum physics for unconditionally secure data communications. This is a main achievement because the cryptography currently in use, known as conventional cryptography, relies completely on the hardness of a mathematical equation. The advances in quantum computing has threatened the computational security of classical cryptography, which in theory can effic...

متن کامل

A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions

A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005